Edge Detection on Polynomial Texture Maps

نویسندگان

  • Cristian Brognara
  • Massimiliano Corsini
  • Matteo Dellepiane
  • Andrea Giachetti
چکیده

In this paper we propose a simple method to extract edges from Polynomial Texture Maps (PTM) or other kinds of Reflection Transformation Image (RTI) files. It is based on the idea of following 2D lines where the variation of corresponding 3D normals computed from the PTM coefficients is maximal. Normals are estimated using a photometric stereo approach, derivatives along image axes directions are computed in a multiscale framework providing normal discontinuity and orientation maps and lines are finally extracted using non-maxima suppression and hysteresis thresholds as in Canny’s algorithm. In this way it is possible to discover automatically potential structure of interest (inscriptions, small reliefs) on Cultural Heritage artifacts of interest without the necessity of interactively recreating images using different light directions. Experimental results obtained on test data and new PTMs acquired in an archaeological site in the Holy Land with a simple low-end camera, show that the method provides potentially useful results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Approach for Edge Detection of Low Contrast Satellite Images

Discrimination between texture edges and geometrical edges is very difficult in low contrast images. Satellite images are low contrast images. It is important to extract the edges that are not clearly visible in case of Satellite images. The present work encompasses a new edge detection algorithm using newly constructed differentiator. Chebyshev polynomial based fractional order differentiator ...

متن کامل

ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS

Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...

متن کامل

Compression of Polynomial Texture Maps

image compression, texture mapping, 3D graphics, JPEG, JPEG-LS, polynomial texture maps Polynomial Texture Maps (PTM's) are representations of stationary 3D objects which provide enhanced image quality and improved perception of the object surface details at the cost of increased storage requirements. In this paper, we investigate several compression schemes for PTM's, that either preserve ever...

متن کامل

Contour and boundary detection improved by surround suppression of texture edges

We propose a computational step, called surround suppression, to improve detection of object contours and region boundaries in natural scenes. This step is inspired by the mechanism of non-classical receptive field inhibition that is exhibited by most orientation selective neurons in the primary visual cortex and that influences the perception of groups of edges or lines. We illustrate the prin...

متن کامل

Contour detection based on nonclassical receptive field inhibition

We propose a biologically motivated method, called nonclassical receptive field (non-CRF) inhibition (more generally, surround inhibition or suppression), to improve contour detection in machine vision. Non-CRF inhibition is exhibited by 80% of the orientation-selective neurons in the primary visual cortex of monkeys and has been shown to influence human visual perception as well. Essentially, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013